Sequences related to the Pell generalized equation

نویسنده

  • Mario Catalani
چکیده

We consider sequences of the type An = 6An−1 − An−2, A0 = r, A1 = s (r and s integers) and show that all sequences that solve particular cases of the Pell generalized equation are expressible as a constant times one of four particular sequences of the same type. Let α = 3 + 2 √ 2, β = 3 − 2 √ 2 be the roots of the polynomial x − 6x+ 1. Note that α+β = 6, αβ = 1, α−β = 4 √ 2. Also let γ = 1+ √ 2, δ = 1− √ 2. Then γ = α, δ = β, γδ = −1. We take γ = α 1 2 , δ = −β 1 2 . Consider the sequence An defined by An = 6An−1 −An−2, A0 = r, A1 = s, (1) where r and s are integers. The object of this contribution is to show that all sequences of the type given by Equation 1 that solve particular cases of the Pell generalized equation (see [3]) are expressible as a constant times one of four particular sequences of the same type. The generating function of An is given by g(x) = r + (s− 7r)x+ (6r − s)x (1− x)(1− 6x+ x) , from which we get the closed form An = 2sγα− 2rγ 8 √ 2γ α − 2rγβ + 2sδβ 8 √ 2δ .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On The Generalized Fibonacci And Pell Sequences By Hessenberg Matrices

In this paper, we consider the generalized Fibonacci and Pell Sequences and then show the relationships between the generalized Fibonacci and Pell sequences, and the Hessenberg permanents and determinants. 1. Introduction The Fibonacci sequence, fFng ; is de…ned by the recurrence relation, for n 1 Fn+1 = Fn + Fn 1 (1.1) where F0 = 0; F1 = 1: The Pell Sequence, fPng ; is de…ned by the recurrence...

متن کامل

A Catalan Transform and Related Transformations on Integer Sequences

We introduce and study an invertible transformation on integer sequences related to the Catalan numbers. Transformation pairs are identified among classical sequences. A closely related transformation which we call the generalized Ballot transform is also studied, along with associated transformations. Results concerning the Fibonacci, Jacobsthal and Pell numbers are derived. Finally, we derive...

متن کامل

Generalized Binet Formulas, Lucas Polynomials, and Cyclic Constants

Generalizations of Binet’s theorem are used to produce generalized Pell sequences from two families of silver means. These Pell sequences are also generated from the family of Fibonacci polynomials. A family of Pell-Lucas sequences are also generated from the family of Lucas polynomials and from another generalization of Binet’s formula. A periodic set of cyclic constants are generated from the...

متن کامل

Formulas For Sums Of Generalized Order-k Fibonacci Type Sequences By Matrix Methods

In this paper, we give formulas for the sums of generalized order-k Fibonacci, Pell and similar other sequences which we obtain using matrix methods. As applications, we give explicit formulas for the Tribonacci and Tetranacci numbers. 1. Introduction The well-known Fibonacci sequence fFng is de…ned for n > 2 by Fn+1 = Fn + Fn 1 where F1 = F2 = 1: The well-known Pell sequence fPng is de…ned for...

متن کامل

Some Properties of Generalized Third Order Pell Numbers

This paper considers some properties of the third order recursive sequence defined by the linear recurrence relation , 2 , 1 , 0 , 3 , 2 3 , 2 , , = ≥ + = − − m n w w w n m n m m n m , with appropriate initial conditions. The present work follows on from the case m = 0 (Shannon et al). Relationships with the well-known sequences of Fibonacci, Lucas and Pell are developed. The motivation for the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003